Finite size scaling for the core of large random hypergraphs
نویسندگان
چکیده
منابع مشابه
Finite size scaling for the core of large random hypergraphs
The (two) core of an hyper-graph is the maximal collection of hyper-edges within which no vertex appears only once. It is of importance in tasks such as efficiently solving a large linear system over GF[2], or iterative decoding of low-density parity-check codes used over the binary erasure channel. Similar structures emerge in a variety of NP-hard combinatorial optimization and decision proble...
متن کاملStructure of Large Random Hypergraphs
The theme of this paper is the derivation of analytic formulae for certain large combinatorial structures. The formulae are obtained via fluid limits of pure jump-type Markov processes, established under simple conditions on the Laplace transforms of their Lévy kernels. Furthermore, a related Gaussian approximation allows us to describe the randomness which may persist in the limit when certain...
متن کاملFinite-Size Scaling in Random $K$-Satisfiability Problems
We provide a comprehensive view of various phase transitions in random K-satisfiability problems solved by stochastic-local-search algorithms. In particular, we focus on the finite-size scaling (FSS) exponent, which is mathematically important and practically useful in analyzing finite systems. Using the FSS theory of nonequilibrium absorbing phase transitions, we show that the density of unsat...
متن کاملFinite-size scaling amplitudes in a random tiling model
We study finite-size corrections to the free energy in a two-dimensional random tiling model. This model is equivalent to an asymmetric six-vertex model and exhibits commensurate-incommensurate phase transitions of the Pokrovsky-Talapov type. We calculate finite-size scaling amplitudes of the free energy inside the incommensurate phase, analytically and numerically, by employing a transfer matr...
متن کاملLaws of Large Numbers for Random Linear
The computational solution of large scale linear programming problems contains various difficulties. One of the difficulties is to ensure numerical stability. There is another difficulty of a different nature, namely the original data, contains errors as well. In this paper, we show that the effect of the random errors in the original data has a diminishing tendency for the optimal value as the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2008
ISSN: 1050-5164
DOI: 10.1214/07-aap514